On Different Models for Generating Random SAT Problems

نویسندگان

  • Predrag Janicic
  • Nenad Dedic
  • Goran Terzic
چکیده

In the last decade a lot of effort has been invested into both theoretical and experimental analysis of sat phase transition. However, a deep theoretical understanding of this phenomenon is still lacking. Besides, many of experimental results are based on some assumptions that are not supported theoretically. In this paper we introduce the notion of sat–equivalence and we prove that some restrictions often used in sat experiments don’t make an impact on location of a crossover point. We consider several fixed and random clause length sat models and relations between them. We also discuss one new sat model and report on a detected phase transition for it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating SAT instances with community structure

Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world, SAT instances. However, the process of development and testing of new SAT solving techniques is conditioned to the finite and reduced number of known industrial benchmarks. Therefore, new models of random SAT instances generation that capture realistically the features of real-world problems can be benefi...

متن کامل

Models for random Constraint

We introduce a class of models for random Constraint Satisfaction Problems. This class includes and generalizes many previously studied models. We characterize those models from our class which are asymptot-ically interesting in the sense that the limiting probability of satissability changes signiicantly as the number of constraints increases. We also discuss models which exhibit a sharp thres...

متن کامل

A Generating Function Method for the Average-Case Analysis of DPLL

A method to calculate the average size of Davis-PutnamLoveland-Logemann (DPLL) search trees for random computational problems is introduced, and applied to the satisfiability of random CNF formulas (SAT) and the coloring of random graph (COL) problems. We establish recursion relations for the generating functions of the average numbers of (variable or color) assignments at a given height in the...

متن کامل

Generating 'Random' 3-SAT Instances with Specific Solution Space Structure

Generating good benchmarks is important for the evaluation and improvement of any algorithm for NP-hard problems such as the Boolean satisfiability (SAT) problem. Carefully designed benchmarks are also helpful in the study of the nature of NP-completeness . Probably the most well-known and successful story is the discovery of the phase transition phenomenon (Cheeseman, Kanefsky, and Taylor 1991...

متن کامل

Should Algorithms for Random SAT and Max-SAT Be Different?

We analyze to what extent the random SAT and Max-SAT problems differ in their properties. Our findings suggest that for random k-CNF with ratio in a certain range, Max-SAT can be solved by any SAT algorithm with subexponential slowdown, while for formulae with ratios greater than some constant, algorithms under the random walk framework require substantially different heuristics. In light of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers and Artificial Intelligence

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2001